An Improved Genetic Algorithm for the Multi Level Uncapacitated Facility Location Problem
نویسندگان
چکیده
منابع مشابه
An Efficient Genetic Algorithm for Solving the Multi-Level Uncapacitated Facility Location Problem
In this paper a new evolutionary approach for solving the multi-level uncapacitated facility location problem (MLUFLP) is presented. Binary encoding scheme is used with appropriate objective function containing dynamic programming approach for finding sequence of located facilities on each level to satisfy clients’ demands. The experiments were carried out on the modified standard single level ...
متن کاملAn Exact Algorithm for Multi-level Uncapacitated Facility Location
Authors are encouraged to submit new papers to INFORMS journals by means of a style file template, which includes the journal title. However, use of a template does not certify that the paper has been accepted for publication in the named journal. INFORMS journal templates are for the exclusive purpose of submitting to an INFORMS journal and should not be used to distribute the papers in print ...
متن کاملAn 0.828-approximation Algorithm for the Uncapacitated Facility Location Problem
The uncapacitated facility location problem in the following formulation is considered: max S⊆I Z(S) = ∑
متن کاملAn incremental algorithm for the uncapacitated facility location problem
We study the incremental facility location problem, wherein we are given an instance of the uncapacitated facility location problem and seek an incremental sequence of opening facilities and an incremental sequence of serving customers along with their fixed assignments to facilities open in the partial sequence. We say that a sequence has a competitive ratio of k, if the cost of serving the fi...
متن کاملA 1.488 Approximation Algorithm for the Uncapacitated Facility Location Problem
We present a 1.488 approximation algorithm for the metric uncapacitated facility location (UFL) problem. The previous best algorithm was due to Byrka [1]. By linearly combining two algorithms A1(γf ) for γf = 1.6774 and the (1.11,1.78)-approximation algorithm A2 proposed by Jain, Mahdian and Saberi [8], Byrka gave a 1.5 approximation algorithm for the UFL problem. We show that if γf is randomly...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: INTERNATIONAL JOURNAL OF COMPUTERS COMMUNICATIONS & CONTROL
سال: 2013
ISSN: 1841-9844,1841-9836
DOI: 10.15837/ijccc.2013.6.134